A subquadratic algorithm for minimum palindromic factorization
نویسندگان
چکیده
We give an O(n logn) time algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string S[1..n], in O(n logn) time our algorithm returns the minimum number of palindromes S1, . . . , Sl such that S = S1 · · ·Sl.
منابع مشابه
Maximal Palindromic Factorization
A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal palindromes in a string in linear time to the length of the given string then using the breadth first sear...
متن کاملWhen Crossings Count — Approximating the Minimum
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings between the spanning tree and the lines. The expected running time of the algorithm is near linear. We also show how to embed such a crossing metric of hyperplanes in d-dimensions, in subquadratic time, into high-dimensions s...
متن کاملGreedy palindromic lengths
In [A. Frid, S. Puzynina, L.Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We introduce variants of this conjecture and prove this conjecture in particular cases. Especially we introduce left and right greedy palindromic lengths. These l...
متن کاملApproximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter
The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another node. In directed graphs, there are several versions of these problems. For instance, one may choose to define the eccentricity of a node in terms of the largest...
متن کاملApproximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences
We present the first subquadratic algorithms for computing similarity between a pair of point sequences in R, for any fixed d > 1, using dynamic time warping (DTW) and edit distance, assuming that the point sequences are drawn from certain natural families of curves. In particular, our algorithms compute (1 + ε)-approximations of DTW and ED in near-linear time for point sequences drawn from κ-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 28 شماره
صفحات -
تاریخ انتشار 2014